Sorting with Efficient Use of Special-Purpose Sorters
نویسندگان
چکیده
The following problem was considered by Mueller [M]: Suppose we have a specialpurpose hardware device that enables us to son p numbers at a time, in time 0 (P). How can a conventional random access machine use such a device to son n numbers, n >p, in better than o(n logn) time? Clearly, it is impossible to hope for better than 0 (n logn/logp) time performance because of the Q(n logn) lower boWld on sorting. Mueller shows that the o (n logn/logp) time bound can be achieved probabilisrically so long as p =.Q(loin). In this
منابع مشابه
Combination of the Sorting Line Priority Polling Control Mechanism
The paper proposed the priority polling control mechanism of the unit material combinations sorting lines, and sorters operating process is understood to be the arrival process of orders, service process of each sorter sorts orders and the conversion process between sorting machines. Control process, sorters of the combined sorting lines are divided into the priority sorters and ordinary sorter...
متن کاملConstructing Sorting Networks from k-Sorters
We study the problem of using sorters of k vabxes to form large sorting and merging networks. For n an integral power of k, we show how to merge k sorted vectors of length n/k each using 4 log, n 3 layers of k-sorters and 4 log* n 5 layers of k=ittiqut binary mergers. As a result, we show how to sort R v&es using 2 iag$ n -log, n layers of k-sorters and 2 logf n 3 fog& n * I fayers of k-input l...
متن کاملEye movements in overall similarity and single-dimension sorting
A free classification study is presented that uses eye-tracking to better characterize the strategies that are employed in the creation of overall similarity and single-dimension categories. The number of fixations across the dimensions and the proportion of dimensions fixated were significantly greater for overall similarity sorters than for single-dimension sorters. Single-dimension sorters g...
متن کاملHigh performance Parallel Linear Sorter Core Design
Hardware sorters exploit inherent concurrency to improve the performance of sequential, softwarebased sorting algorithms. They are often based on Batcher’s odd-even or bitonic merging networks to attenuate the areagreedy hardware solutions. In this paper, a new hardware sorter architecture is presented. It is composed of smaller sorter circuits inspired on insertion sorting algorithms that cont...
متن کاملSome Topological Properties of Bitonic Sorters
This paper proves some topological properties of bitonic sorters, which have found applications in constructing, along with banyan networks, internally nonblocking switching fabrics in future broadband networks. The states of all the sorting elements of an N N bitonic sorter are studied for four different input sequences ai i N ; @ =1, bi i N ; @ =1, ci i N ; @ =1, and di i N ; @ =1, where ai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 27 شماره
صفحات -
تاریخ انتشار 1988